Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
61	Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic Viktor Kuncak1 and Martin Rinard2 1 Ecole Politechnique F´ed´erale de Lausanne, Lausanne, VD, Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2007-12-05 11:59:40 Logic in computer science Model theory Complexity classes Boolean algebra Electronic design automation Boolean satisfiability problem Presburger arithmetic Quantifier elimination Decision problem Theoretical computer science Computational complexity theory Applied mathematics
62	Symbolic Resource Bound Inference for Functional Programs Ravichandhran Madhavan1 and Viktor Kuncak2 1 2 Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2014-05-24 11:45:01 Formal methods Electronic design automation Logic in computer science NP-complete problems Model theory Function Boolean satisfiability problem Structure Parameter Mathematics Theoretical computer science Mathematical logic
63	Software Synthesis Procedures ∗ Viktor Kuncak Mikaël Mayer LARA, I&C Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2011-12-03 07:53:01 Model theory Logic in computer science Constraint programming Electronic design automation Formal methods Satisfiability Modulo Theories Boolean satisfiability problem First-order logic Interpretation Mathematical logic Theoretical computer science Mathematics
64	ATL* Satisfiability is 2EXPTIME-Complete⋆ Sven Schewe Universit¨ at des Saarlandes, 66123 Saarbr¨ ucken, Germany Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2008-09-22 13:34:08 Formal methods Model checking Entailment Boolean satisfiability problem Logic Theoretical computer science Deduction
65	Decision Procedures for Multisets with Cardinality Constraints Ruzica Piskac and Viktor Kuncak School of Computer and Communication Science ´ Ecole Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2007-12-11 06:05:40 Cardinality Set Combination Boolean satisfiability problem Generalized arithmetic progression Permutation Polynomial Mathematics Combinatorics Multiset
66	Course: Satisfiability Modulo Theories (SMT): ideas and applications Send your assignment to: 1. Mark the following formulas as valid, satisfiable or unsatisfiable. a. p  q  p  q b. (p  Add to Reading List Source URL: leodemoura.github.io Language: English - Date: 2015-05-19 13:22:05 NP-complete problems Mathematical logic Electronic design automation Formal methods Logic in computer science Boolean satisfiability problem Resolution Satisfiability Modulo Theories If and only if Theoretical computer science Mathematics Logic
67	Algorithms Lecture 4: Efficient Exponential-Time Algorithms [Fa’14] Wouldn’t the sentence “I want to put a hyphen between the words Fish and And and And and Chips in my Fish-And-Chips sign.” have been clearer if Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:22 NP-complete problems Analysis of algorithms Graph coloring Graph theory Time complexity Boolean satisfiability problem Randomized algorithm MAXEkSAT One-in-three 3SAT Theoretical computer science Computational complexity theory Mathematics
68	SAT and Hybrid models of the Car Sequencing problem Christian Artigues1,2 , Emmanuel Hebrard1,2 , Valentin Mayer-Eichberger3,4 , Mohamed Siala1,5 , and Toby Walsh3,4 1 CNRS, LAAS, 7 avenue du colonel Roche, FToul Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-02-14 15:26:57 Computer programming Local consistency Backtracking Constraint learning Propagator Boolean satisfiability problem Constraint programming Theoretical computer science Software engineering
69	SAT 2009 competitive events booklet: preliminary version Organizers SAT competition: Daniel Le Berre, Olivier Roussel, Laurent Simon PB competition: Vasco Manquinho, Olivier Roussel Max-SAT competition: Josep Argelich, C Add to Reading List Source URL: www.cril.univ-artois.fr Language: English - Date: 2009-09-30 10:44:43 Logic in computer science Automated theorem proving Numerical software Electronic design automation Formal methods Boolean satisfiability problem 2-satisfiability Satz GRASP Theoretical computer science Mathematics Applied mathematics
70	Synthesizing and Verifying Plans for Constrained Workflows: Transferring Tools from Formal Methods Jason Crampton Michael Huth Add to Reading List Source URL: icaps11.icaps-conference.org Language: English - Date: 2013-04-15 04:52:48 Management Logic Model theory Linear temporal logic Temporal logic Workflow Satisfiability YAWL Boolean satisfiability problem Mathematical logic Workflow technology Theoretical computer science